/**
 * https://www.luogu.com.cn/problem/P2004
 */

#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int M=1e3+10;
ll a[M][M];
int main()
{
	int n,m,c;
	cin>>n>>m>>c;
	int x,y;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=m;++j){
			cin>>a[i][j];
			a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
		}
		ll ans=0;
	for(int i=c;i<=n;++i)
		for(int j=c;j<=m;++j)
		if(a[i][j]-a[i-c][j]-a[i][j-c]+a[i-c][j-c]>ans){
			x=i-c+1;
			y=j-c+1;
			ans=a[i][j]-a[i-c][j]-a[i][j-c]+a[i-c][j-c];
		}
		cout<<x<<" "<<y<<endl;
}